Planning with Linear Continuous Numeric Change
نویسندگان
چکیده
Reasoning with domains containing continuous numeric change remains an open challenge in planning. In this paper, we discuss how an established temporal planner, CRIKEY3, can be adapted to plan in domains containing linear continuous numeric change. In particular, we discuss how an LP can be used to scheudule action choices, and how the LPRPG heuristic (hitherto for non-temporal planning) can be adapted for use in a temporal and linear-continuous setting.
منابع مشابه
Temporal Planning in Domains with Linear Processes
We consider the problem of planning in domains with continuous linear numeric change. Such change cannot always be adequately modelled by discretisation and is a key facet of many interesting problems. We show how a forward-chaining temporal planner can be extended to reason with actions with continuous linear effects. We extend a temporal planner to handle numeric values using linear programmi...
متن کاملCOLIN: Planning with Continuous Linear Numeric Change
In this paper we describe COLIN, a forward-chaining heuristic search planner, capable of reasoning with COntinuous LINear numeric change, in addition to the full temporal semantics of PDDL2.1. Through this work we make two advances to the state-of-the-art in terms of expressive reasoning capabilities of planners: the handling of continuous linear change, and the handling of duration-dependent e...
متن کاملPlanning for Mixed Discrete Continuous Domains
Mixed discrete-continuous systems are hybrid systems that exhibit both discrete changes of state, describable in terms of their logical and metric properties, and continuous numeric change describable in terms of differential equations. Continuous change occurs within a state as a consequence of one or more continuous processes being active in that state, whilst discrete change results in state...
متن کاملForward-Chaining Partial-Order Planning
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approaches of UCPOP and VHPOP. In this paper we explore the potential of a forward-chaining state-based search strategy to support partial-order planning in the solution of temporal-numeric problems. Our planner, POPF, is buil...
متن کاملTemporal Planning for Interacting Durative Actions with Continuous Effects
One of the most important properties of temporal planners is their capability of integrating planning into scheduling so that time can be considered as an optimization objective. Forward chaining temporal planners provides tight coupling of planning and scheduling. In these planners, a search node is represented by a world state including the applied action directly attached with a world clock ...
متن کامل